Optimal and Fair Transmission Rate Allocation Problem in Multi-hop Cellular Networks
نویسندگان
چکیده
We deal with the rate allocation problem for downlink in a Multi-hop Cellular Network. A mathematical model is provided to assign transmission rates in order to reach an optimal and fair solution. We prove that under some conditions that are often met, the problem can be reduced to a single-hop cellular network problem. The validity of our proof is confirmed experimentally.
منابع مشابه
Asymptotic Close to Optimal Resource Allocation in Centralized Multi-band Wireless Networks
This paper concerns sub-channel allocation in multi-user wireless networks with a view to increasing the network throughput. It is assumed there are some sub-channels to be equally divided among active links, such that the total sum rate increases, where it is assumed each link is subject to a maximum transmit power constraint. This problem is found to be a non-convex optimization problem and i...
متن کاملA Hidden Node Aware Network Allocation Vector Management System for Multi-hop Wireless Ad hoc Networks
Many performance evaluations for IEEE 802.11distributed coordination function (DCF) have been previouslyreported in the literature. Some of them have clearly indicatedthat 802.11 MAC protocol has poor performance in multi-hopwireless ad hoc networks due to exposed and hidden nodeproblems. Although RTS/CTS transmission scheme mitigatesthese phenomena, it has not been successful in thoroughlyomit...
متن کاملThroughput Maximization for Multi-Slot Data Transmission via Two-Hop DF SWIPT-Based UAV System
In this paper, an unmanned aerial vehicle (UAV) assisted cooperative communication system is studied, wherein a source transmits information to the destination through an energy harvesting decode-and-forward UAV. It is assumed that the UAV can freely move in between the source-destination pair to set up line of sight communications with the both nodes. Since the battery of the UAV may be limite...
متن کاملUtility Optimal Coding for Packet Transmission over Wireless Networks – Part II: Networks of Packet Erasure Channels
We define a class of multi–hop erasure networks that approximates a wireless multi–hop network. The network carries unicast flows for multiple users, and each information packet within a flow is required to be decoded at the flow destination within a specified delay deadline. The allocation of coding rates amongst flows/users is constrained by network capacity. We propose a proportional fair tr...
متن کاملJoint Scheduling, Power Control and Routing in Symmetric, One-dimensional, Multi-hop Wireless Networks
We are interested in finding a jointly optimal scheduling, routing and power control that achieves max-min fair rate allocation in a multi-hop wireless network. This is a highly complex non-convex optimization problem and it has been previously solved only for small networks. We restrict ourselves to symmetric networks with ring and line topologies, and we numerically solve the problem for a la...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2009